A complete rewrite system and normal forms for ( S ) reg
نویسندگان
چکیده
The (.)reg construction was introduced in order to make an arbitrary semigroup S divide a regular semigroup (S)reg which shares some important properties with S (e.g., finiteness, subgroups, torsion bounds, J-order structure). We show that (S)reg can be described by a rather simple complete string rewrite system, as a consequence of which we obtain a new proof of the normal form theorem for (S)reg. The new proof of the normal form theorem is conceptually simpler than the previous proofs.
منابع مشابه
Simulation as a Correct Transformation of Rewrite Systems
Kamperman and Walters proposed the notion of a simulation of one rewrite system by another one, whereby each term of the simulating rewrite system is related to a term in the original rewrite system. In this paper it is shown that if such a simulation is sound and complete and preserves termination, then the transformation of the original into the simulating rewrite system constitutes a correct...
متن کاملA complete rewrite system and reduced forms for (S)reg
[Significance of (S)reg: aperiodicity, etc.] Notation: By >L, ≤L, ≡L we denote Green’s well known L-relations (and similarly for R). We also use ≡D (D-equivalence). See e.g. [4]. A less familiar notion is the L-incomparability relation >| L defined as follows: s < >| L t iff neither s ≤L t nor s ≥L t. We also define L-comparability: s <>L t iff either s ≤L t or s ≥L t. A similar notation is use...
متن کاملA Complete Equational Axiomatization for Bpa with Preex Iteration
Preex iteration x is added to Basic Process Algebra with deadlock and empty process. We present a nite equational axiomatization for this process algebra, and we prove that this axiomatization is complete with respect to strong bisimulation equivalence. This result is a mild generalization of a similar result in the setting of basic CCS in Fokkink (1994b). To obtain this completeness result, we...
متن کاملSemantics Of Non-Terminating Systems Through Term Rewriting
This thesis is primarily concerned with the algebraic semantics of non-terminating term rewriting systems. The usual semantics for rewrite system is based in interpreting rewrite rules as equations and rewriting as a particular case of equational reasoning. The termination of a rewrite system ensures that every term has a value (normal form). But, in general we cannot guarantee this. The resear...
متن کاملCanonical Sets of Horn Clauses
1 Background Rewrite rules are oriented equations used to replace equals-by-equals in the speciied direction. Input terms are repeatedly rewritten according to the rules. When and if no rule applies, the resultant normal form is considered the value of the initial term. If no innnite sequences of rewrites is possible, a rewrite system is said to have the termination property. Connuence of a rew...
متن کامل